Partial‐histogram design without frame rate and data loss based on gray code peak searching
نویسندگان
چکیده
Abstract This letter presents a high frame rate and low area cost partial histogram scheme for d‐ToF depth imaging sensor based on SPAD. realizes through novel peak seeking algorithm gray code pipeline operation that firstly adopted. Area is reduced by overlap used to prevent data loss. Finally, 24 bins partial‐histogram design implemented ASIC flow with total of 11724 μm 2 under 130 nm. FPGA also verify feasibility. Compared other known schemes, proposed method has no
منابع مشابه
Design of Structured Regular LDPC Codes without Short Cycles using Gray Code Representations
Low Density Parity Check (LDPC) codes are specified by the parity check matrix H. Smaller girths in the Tanner graphs of LDPC codes prevent the sum-product algorithm from converging, i.e., short cycles in H-matrix degrade the performance of LDPC decoder. In this paper, we present an algorithm for constructing LDPC codes without short cycles. The H-matrix must be sufficiently sparse to increase ...
متن کاملmodeling loss data by phase-type distribution
بیمه گران همیشه بابت خسارات بیمه نامه های تحت پوشش خود نگران بوده و روش هایی را جستجو می کنند که بتوانند داده های خسارات گذشته را با هدف اتخاذ یک تصمیم بهینه مدل بندی نمایند. در این پژوهش توزیع های فیزتایپ در مدل بندی داده های خسارات معرفی شده که شامل استنباط آماری مربوطه و استفاده از الگوریتم em در برآورد پارامترهای توزیع است. در پایان امکان استفاده از این توزیع در مدل بندی داده های گروه بندی ...
Topology and Routing Algorithm Based on the Combination Gray Code with Johnson Code
Hypercubes utilizing Gray Code are used widely as the interconnection networks of parallel computer systems. But an n-dimensional hypercube has 2n nodes, when the size of a network have been increases added nodes must be 2i times more than its nodes and increase the degree of nodes , which affects scalable characteristic. The paper puts forward a scalable hypercube based on the Combination Gray...
متن کاملSearching Complex Data Without an Index
Indexing through preprocessing is the basis of search today. Unfortunately, as described in Section 2, there are real-world situations where we don’t know how to automate the creation of an index. In addition, it is not possible to preprocess live sources of data such as a collection of webcams on the Internet. How can one search such data? In this paper, we show how query-specific content-base...
متن کاملFrame-based Data Factorizations
Archetypal Analysis is the method of choice to compute interpretable matrix factorizations. Every data point is represented as a convex combination of factors, i.e., points on the boundary of the convex hull of the data. This renders computation inefficient. In this paper, we show that the set of vertices of a convex hull, the so-called frame, can be efficiently computed by a quadratic program....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2023
ISSN: ['0013-5194', '1350-911X']
DOI: https://doi.org/10.1049/ell2.12745